Linear Logic & Elementary Time
نویسنده
چکیده
Think of elementary linear logic as an idealized functional programming language with a severe typing mechanism. Definition by recursion is, of course, forbidden, but some sort of iteration still is possible and the purpose of this paper is to show that enough computing power remains so that elementary recursive functions can be implemented. Actually, the whole paper can be considered an exercise in programming elegantly with a rather desolate language.
منابع مشابه
Linear Formulas in Continuous Logic
We prove that continuous sentences preserved by the ultramean construction (a generalization of the ultraproduct construction) are exactly those sentences which are approximated by linear sentences. Continuous sentences preserved by linear elementary equivalence are exactly those sentences which are approximated in the Riesz space generated by linear sentences. Also, characterizations for linea...
متن کاملElementary linear logic revisited for polynomial time and an exponential time hierarchy (extended version)
Elementary linear logic is a simple variant of linear logic, introduced by Girard and which characterizes in the proofs-as-programs approach the class of elementary functions (computable in time bounded by a tower of exponentials of fixed height). Other systems, like light linear logic have then been defined to capture in a similar way polynomial time functions, but at the price of either a mor...
متن کاملLinear logic and elementary time
A subsystem of linear logic, elementary linear logic, is defined and shown to represent exactly elementary recursive functions. Its choicest part consists in reducing the deductive power of the exponential, also known as the ‘‘bang,’’ which, in linear logic, is in charge of controlling duplication in the cut-elimination process. 2003 Elsevier Science (USA). All rights reserved.
متن کاملElementary Linear Logic Revisited for Polynomial Time and an Exponential Time Hierarchy
Elementary linear logic is a simple variant of linear logic, introduced by Girard and which characterizes in the proofs-as-programs approach the class of elementary functions, that is to say computable in time bounded by a tower of exponentials of fixed height. Our goal here is to show that despite its simplicity, elementary linear logic can nevertheless be used as a common framework to charact...
متن کاملOn Elementary Linear Logic and polynomial time
Linear logic (LL) [Gir87] has been used in implicit computational complexity to characterize various complexity classes within the proofs-as-programs approach. This can then be the basis of type systems to guarantee complexity properties on lambda-calculus. As duplication is controlled in LL by the connective ! the key idea of this line of work is to consider variants of this system with a weak...
متن کاملOn the expressivity of elementary linear logic: Characterizing Ptime and an exponential time hierarchy
Elementary linear logic is a simple variant of linear logic due to Girard and which characterizes in the proofs-as-programs approach the class of elementary functions, that is to say functions computable in time bounded by a tower of exponentials of fixed height. Other systems like light and soft linear logics have then been defined to characterize in a similar way the more interesting complexi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001